Metrics for Single-Edged Graphs over a Fixed Set of Vertices
نویسندگان
چکیده
منابع مشابه
Circuits in Graphs through a prescribed Set of Ordered vertices
A circuit in a simple undirected graphG = (V,E) is a sequence of vertices {v1, v2, . . . , vk+1} such that v1 = vk+1 and {vi, vi+1} ∈ E for i = 1, . . . , k. A circuit C is said to be edgesimple if no edge of G is used twice in C. In this article we study the following problem: which is the largest integer k such that, given any subset of k ordered vertices of a graph G, there exists an edge-si...
متن کاملSingle Assignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks
The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...
متن کاملStrong convergence of variational inequality problem Over the set of common fixed points of a family of demi-contractive mappings
In this paper, by using the viscosity iterative method and the hybrid steepest-descent method, we present a new algorithm for solving the variational inequality problem. The sequence generated by this algorithm is strong convergence to a common element of the set of common zero points of a finite family of inverse strongly monotone operators and the set of common fixed points of a finite family...
متن کاملA fixed point result for a new class of set-valued contractions
In this paper, we introduce a new class of set-valued contractions and obtain a xed point theoremfor such mappings in complete metric spaces. Our main result generalizes and improves many well-known xed point theorems in the literature.
متن کاملgraphs with fixed number of pendent vertices and minimal first zagreb index
the first zagreb index $m_1$ of a graph $g$ is equal to the sum of squaresof degrees of the vertices of $g$. goubko proved that for trees with $n_1$pendent vertices, $m_1 geq 9,n_1-16$. we show how this result can beextended to hold for any connected graph with cyclomatic number $gamma geq 0$.in addition, graphs with $n$ vertices, $n_1$ pendent vertices, cyclomaticnumber $gamma$, and minimal $m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computational Applications
سال: 2018
ISSN: 2297-8747
DOI: 10.3390/mca23040066